On derived equivalences of lines, rectangles and triangles

نویسنده

  • Sefi Ladkani
چکیده

We present a method to construct new tilting complexes from existing ones using tensor products, generalizing a result of Rickard. The endomorphism rings of these complexes are generalized matrix rings that are “componentwise” tensor products, allowing us to obtain many derived equivalences that have not been observed by using previous techniques. Particular examples include algebras generalizing the ADE-chain related to singularity theory, incidence algebras of posets and certain Auslander algebras or more generally endomorphism algebras of initial preprojective modules over path algebras of quivers. Many of these algebras are fractionally Calabi-Yau and we explicitly compute their CY dimensions. Among the quivers of these algebras one can find shapes of lines, rectangles and triangles.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE USE OF KULSHAMMER TYPE INVARIANTS IN REPRESENTATION THEORY

Since 2005 a new powerful invariant of an algebra has emerged using the earlier work of Horvath, Hethelyi, Kulshammer and Murray. The authors studied Morita invariance of a sequence of ideals of the center of a nite dimensional algebra over a eld of nite characteristic. It was shown that the sequence of ideals is actually a derived invariant, and most recently a slightly modied version o...

متن کامل

Almost D-split sequences and derived equivalences

In this paper, we introduce almost D-split sequences and establish an elementary but somewhat surprising connection between derived equivalences and Auslander-Reiten sequences via BB-tilting modules. In particular, we obtain derived equivalences from Auslander-Reiten sequences (or n-almost split sequences), and Auslander-Reiten triangles.

متن کامل

A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs

We propose a branch-and-bound algorithm for solving nonconvex quadratically-constrained quadratic programs. The algorithm is novel in that branching is done by partitioning the feasible region into the Cartesian product of two-dimensional triangles and rectangles. Explicit formulae for the convex and concave envelopes of bilinear functions over triangles and rectangles are derived and shown to ...

متن کامل

Illuminating Rectangles and Triangles in the Plane

A set S of light sources, idealized as points, illuminates a collection F of convex sets if each point in the boundary of the sets of F is visible from at least one point in S. For any n disjoint plane isothetic rectangles, Î(4n+4)/3 ̊ lights are sufficient to illuminate their boundaries. If in addition, the rectangles have equal width, then n+1 lights always suffice and n-1 are occasionally nec...

متن کامل

On Tensor Product of Graphs, Girth and Triangles

The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. London Math. Society

دوره 87  شماره 

صفحات  -

تاریخ انتشار 2013